A Non-ILP Based Threshold Logic Synthesis Methodology

Threshold logic is a powerful alternative to Boolean logic. Recently there has been renewed interest in the synthesis of threshold networks that implement logic functions. Until now, different heuristics have been proposed to generate threshold networks starting from the Boolean network of a function. These methods are essentially recombination of nodes of the Boolean network. We propose a new methodology for the synthesis of threshold networks starting from the factored form of the function. Two versions of the algorithm are proposed. One of them is shown to be optimal for a specific type of factored form. We compare our results against the previous approaches and on an average get a gate reduction of 14.14% and a delay reduction of 24%. The novelty in the work is the elimination of the use of the ILP formulation, that is extensively used by all the previous methods to detect threshold networks and to assign feasible weights.